Location:
Search - minimum energy
Search list
Description: 基于能量最小原理计算脊椎受力和形状的matlab程序。我自己编写的。-Calculated based on the principle of minimum energy shape of the spine by the force and matlab process. I have written.
Platform: |
Size: 2048 |
Author: youthie |
Hits:
Description: 阿尔茨海默病目前在临床上的诊断标准就是判断是否发生了海马体积上变异，该病的程度与海马体积的萎缩量有着密切的关系。
分水岭算法最大的缺陷是过分割问题比较严重，利用分水线处能量值最小的理论，可以调整分水岭算法获得的轮廓，限制过分割。
-Alzheimer' s disease currently in clinical diagnostic criteria is to determine whether the mutation occurred on hippocampal volume, extent of the disease and the shrinkage of hippocampal volume is closely related to the amount. Watershed algorithm is the biggest flaw is more serious problem of over-segmentation using watershed line of the theoretical minimum energy value, can be adjusted to obtain the outline of the watershed algorithm to limit over-segmentation.
Platform: |
Size: 1858560 |
Author: fuky |
Hits:
Description: fmincon函数的应用实例，求最小能量-fmincon function of the application instance, find the minimum energy
Platform: |
Size: 160768 |
Author: linjiming |
Hits:
Description: 为了执行的立体视差估计算法的区域匹配方法由全局最小的平滑误差能量函数-To the implementation of the disparity estimation algorithm area matching the global minimum energy function of the smoothing error
Platform: |
Size: 235520 |
Author: 王展 |
Hits:
Description: 在图像处理中，有些图像既没有明显的边缘，也缺乏明显的纹理特征，传统的分割方法及GAC模型将难以成功实现图像分割。于是提出了C-V模型，其基本思想与传统的基于区域的图像分割方法是一致的：都是根据能量最小原则。
-Image processing, some of the images is neither obvious edge, but also the lack of obvious texture features, the traditional method of segmentation and the GAC model will be difficult to successfully achieve segmentation. Therefore, put forward a CV model, the basic idea of the traditional region-based image segmentation method is the same: are based on the principle of minimum energy.
Platform: |
Size: 1024 |
Author: 六预防 |
Hits:
Description: 37signals成功经验，讲求精简时间缩小团队，以一切最小的能量创造财富和最大的能量。是一本好书。-The 37signals successful experience, emphasis on streamlining the time to narrow the team to create wealth in all minimum energy and maximum energy. It is a good book.
Platform: |
Size: 2931712 |
Author: 徐泽 |
Hits:
Description: A combining breadth-first search (BFS) or depth-first search (DFS) with aware range to find minimum connected dominating set
A backbone in a Wireless Sensor Network (WSN) reduces the communication overhead, increases the bandwidth efficiency, decreases the overall energy consumption and thus increases network operational life.The nodes in a wireless sensor network forward data towards a sink via other nodes. The limited resources on the nodes require minimum energy to be spent in this energy consuming task. This necessitates a virtual backbone that can minimize the number of hops required to reach the sink assuming that all nodes have equal transmission range. In the wireless domain, this backbone is a minimum connected dominating set.
In this paper, I propose using breadth-first search (BFS) or depth-first search (DFS) with given range to find minimum connected dominating set.
Please visit: http://iftekharkabir1987.wordpress.com/
Platform: |
Size: 174080 |
Author: jonh |
Hits:
Description: 移动机器人路径规划是机器人学的一个重要研究领域。它要求机器人依据某个或某些优化原则(如最小能量消耗，最短行走路线，最短行走时间等)，在其工作空间中找到一条从起始状态到目标状态的能避开障碍物的最优路径，本代码应用蚁群算法来解决这个问题！-Mobile robot path planning is an important research field of robotics. It requires one or some of the robot based on the principle of optimization (such as the minimum energy consumption and the shortest walking route, the shortest travel time, etc.), to find the path from the initial state to the target state can avoid an obstacle in its optimal working space path, the code ant colony algorithm to solve this problem!
Platform: |
Size: 2048 |
Author: 冯丁 |
Hits:
Description: —In this paper, an energy-efficient optimal relay
selection strategy which is jointly optimized with the energy-
efficient optimal power allocation solution for AF cooperative
transmission is proposed. The relay selection criterion is the
distance to the optimal relay locations where the minimum
transmission power of the source, the relay or their total
can be achieved. To determine those most energy-efficient
relay locations, a universal algorithm with low computational
complexity and easy implementation is also presented in this
paper. The simulations are conducted to validate our theoretical
analysis. The results show that with the relay selected by the
proposed strategy, the cooperative transmission can achieve
considerably high energy-efficiency.
Platform: |
Size: 413696 |
Author: mozhii |
Hits:
Description: 使用连续曲线来表达目标边缘，并定义一个能量泛函使得其自变量包括边缘曲线，因此分割过程就转变为求解能量泛函的最小值的过程，一般可通过求解函数对应的欧拉(Euler．Lagrange)方程来实现，能量达到最小时的曲线位置就是目标的轮廓所在。-Continuous curve to express goal edge, and define an energy functional so that its arguments including edge curve, so segmentation process is transformed into the process of solving the minimum energy functional, and generally function by solving the corresponding Euler (Euler. Lagrange) equations to achieve the minimum energy to reach the position of the curve is where the contour of an object.
Platform: |
Size: 15866880 |
Author: 李祥霞 |
Hits:
Description: 可生成从任意点发射攻击全球任意点的一条最小能量弹道，并确定关机点参数。-Can generate a minimum energy trajectory launch attacks from any point to any point worldwide, and to determine the shutdown point parameters.
Platform: |
Size: 2048 |
Author: xiekongshu |
Hits:
Description: Abstract—We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost
routing (RMECR) and reliable minimum energy routing (RMER). RMECR addresses three important requirements of ad hoc networks:
energy-efficiency, reliability, and prolonging network lifetime. It considers the energy consumption and the remaining battery energy of
nodes as well as quality of links to find energy-efficient and reliable routes that increase the operational lifetime of the network. RMER,
on the other hand, is
Platform: |
Size: 4096 |
Author: ramakant |
Hits:
Description: Abstract—We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost
routing (RMECR) and reliable minimum energy routing (RMER). RMECR addresses three important requirements of ad hoc networks:
energy-efficiency, reliability, and prolonging network lifetime. It considers the energy consumption and the remaining battery energy of
nodes as well as quality of links to find energy-efficient and reliable routes that increase the operational lifetime of the network. RMER,
on the other hand, is
Platform: |
Size: 1024 |
Author: ramakant |
Hits:
Description: ndustrial robot manipulator based on the minimum energy consumption
Platform: |
Size: 122880 |
Author: unesha |
Hits:
Description: 5dof Industrial
robot manipulator based on the minimum energy consumption
Platform: |
Size: 4096 |
Author: unesha |
Hits:
Description: inverse kinematics Industrial
robot manipulator based on the minimum energy consumption
Platform: |
Size: 5120 |
Author: unesha |
Hits:
Description: matlab实现cdma多用户检测几种算法比较
此模型是的信号发生器是由b.mat的simulink模型动态生成，共有10个用户，扩频信号是由gold码或产生，共有恒模算法、子空间算法、改进型恒模算法和最小能量检测算法等几个算法程序。-matlab achieve cdma multi-user detection Several algorithms compare this model is the signal generator is dynamically generated by b.mat the simulink model, a total of 10 users, spread spectrum signal is generated by a gold code or a total of CMA, subspace algorithm, improved CMA and minimum energy detection algorithm several algorithms procedures.
Platform: |
Size: 8192 |
Author: 高洲 |
Hits:
Description: Simulated Annealing (SA) is the oldest probabilistic
meta-heuristic algorithm and one of the first algorithms
having ability to avoid being trapped in local minima. It
is inspired by the process of annealing in metallurgy. In
this process a material is heated and slowly cooled into
solid crystal state with minimum energy and larger
crystal size to reduce defects in metallic structures. Once
the system has cooled, the configuration will represent a
sample at or close to a global optimum.
Platform: |
Size: 2048 |
Author: sorayya |
Hits:
Description: 该类方法主要指的是活动轮廓模型（active contour model）以及在其基础上发展出来的算法，其基本思想是使用连续曲线来表达目标边缘，并定义一个能量泛函使得其自变量包括边缘曲线，因此分割过程就转变为求解能量泛函的最小值的过程，一般可通过求解函数对应的欧拉(Euler．Lagrange)方程来实现，能量达到最小时的曲线位置就是目标的轮廓所在。-Such methods mainly refers to the active contour model (active contour model) and the algorithm developed at its foundation, the basic idea is the use of a continuous curve to express the target edge and define an energy functional so that its arguments include edge curve Therefore segmentation process is transformed into solving process minimum energy functional, and can be obtained by solving the corresponding Euler function (Euler.Lagrange) equation to achieve, achieve energy curve position the hour is the goal of the contour lies.
Platform: |
Size: 39936 |
Author: 毛巴马 |
Hits:
Description: 采用matlab编写的程序，利用最小能量法，实现图像立体匹配-Using matlab program, using the minimum energy method, the realization of stereo image matching
Platform: |
Size: 2103296 |
Author: 李华 |
Hits: